Rendez-vous avec l’islam. Paris, Grasset, 2005, 262 p.
نویسندگان
چکیده
منابع مشابه
Asynchronous Rendez-vous in Distributed Logic Programming
In this paper the semantics of the communication mechanism of the distributed logic programming language DLP is studied. DLP combines logic programming with object oriented features and parallelism. For an abstract subset of DLP both an operational and denotational semantics is given. The language DLP supports active objects, method call by rendezvous and moreover (distributed) backtracking ove...
متن کاملResurrecting Ada's Rendez-Vous in Java
Java is a programming language designed with concurrency in mind from its inception. However, the synchronization mechanism provided is a restricted version of Hoare’s Monitors, being too low level for most applications. In this paper we propose a high level synchronization mechanism for Java, based on Ada’s Rendez-Vous, adapting the notation and semantics to Java. The result is a nice and read...
متن کاملA Eulerian approach to the analysis of rendez-vous algorithms
In this paper we analyze rendez-vous algorithms in the situation when agents can only exchange information below a given distance threshold R. We study the system under an Eulerian point of view considering (possibly continuous) probability distributions of agents and we present convergence results both in discrete and in continuous time. The limit distribution is always necessarily a convex co...
متن کاملMinimally invasive treatment of cholecysto-choledochal lithiasis - "Rendez-vous" technique.
INTRODUCTION In our paper we present the results of a study that was meant to provide a complex answer to the question:"Which is the most appropriate, most correct and least expensive treatment for mixt cholecysto-choledochal lithiasis(MCCL)?" MATERIAL AND METHODS Based on a five year experience (2008-2012), analysed retrospectively, during which 143 patients with MCCL were treated, we are tr...
متن کاملShortest Paths for a Two-robot Rendez-vous
In this paper, we consider an optimal motion planning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the robots can travel to move from their initial positions to positions in which they are able to communicate. In order to communicate, the robots need to be visible to one another. We give e cient algorithms for minimizing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstracta Iranica
سال: 2007
ISSN: 0240-8910,1961-960X
DOI: 10.4000/abstractairanica.18771